Polar Codes: Characterization of Exponent, Bounds, and Constructions
نویسندگان
چکیده
منابع مشابه
Polarization Codes: Characterization of Exponent, Bounds, and Constructions
Polarization codes were recently introduced by Arıkan. They achieve the capacity of arbitrary symmetric binaryinput discrete memoryless channels (and even extensions thereof) under a low complexity successive decoding strategy. The original polar code construction is closely related to the recursive construction of Reed-Muller codes and is based on the 2× 2 matrix
متن کاملSeparating Codes: Constructions and Bounds
Separating codes, initially introduced to test automaton, have revived lately in the study of fingerprinting codes, which are used for copyright protection. Separating codes play their role in making the fingerprinting scheme secure agains coalitions of pirates. We provide here better bounds, constructions and generalizations for these codes.
متن کاملLexicographic Codes: Constructions Bounds, and Trellis Complexity
We study lexicographic codes, which are generated by an iterative greedy construction. We analyze the relationship between successive iterations in this construction, and derive bounds on the parameters of the resulting codes that are tighter than the presently known bounds. Furthermore, we generalize the lexico-graphic construction to produce families of codes that combine the excellent rate a...
متن کاملBounds and Constructions for Multireceiver Authentication Codes
Multireceiver authentication codes allow one sender to construct an authenticated message for a group of receivers such that each receiver can verify authenticity of the received message. In this paper, we give a formal deenition of multireceiver authentication codes, derive information theoretic and combinatorial lower bounds on their performance and give new eecient constructions for such cod...
متن کاملSeveral Classes of Concatenated Quantum Codes: Constructions and Bounds
In this paper we present several classes of asymptotically good concatenated quantum codes and derive lower bounds on the minimum distance and rate of the codes. We compare these bounds with the best-known bound of Ashikhmin–Litsyn–Tsfasman and Matsumoto. We also give a polynomial-time decoding algorithm for the codes that can decode up to one fourth of the lower bound on the minimum distance o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2010
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2010.2080990